Boolean operations of geometric models is an essential issue in computationalgeometry. In this paper, we develop a simple and robust approach to performBoolean operations on closed and open triangulated surfaces. Our method mainlyhas two stages: (1) We firstly find out candidate intersected-triangles pairsbased on Octree and then compute the inter-section lines for all pairs oftriangles with parallel algorithm; (2) We form closed or openintersection-loops, sub-surfaces and sub-blocks quite robustly only accordingto the cleared and updated topology of meshes while without coordinatecomputations for geometric enti-ties. A novel technique instead ofinside/outside classification is also proposed to distinguish the resultingunion, subtraction and intersection. Several examples have been given toillus-trate the effectiveness of our approach.
展开▼
